Minimizing the mean slowdown in a single-server queue
نویسندگان
چکیده
منابع مشابه
FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملMEAN TANDEM SOJOURN TIMES QUEUE SERVED IN A BY A Tsuyoshi Katayama MULTI - STAGE SINGLE SERVER
This paper presents explicit expressions for the mean sojourn times in a multi-stage tandem queue, with Poisson arrival and general service times, served by a s,ingle server with a cyclic switching rule, M/GI-G2-"'GN/l. The expressions are derived using the results of the two-stage tandem queue, M/GI-G2/1, already considered by some authors and the well-known Pollaczek-Khintchine formula. With ...
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2022
ISSN: ['1572-9443', '0257-0130']
DOI: https://doi.org/10.1007/s11134-022-09777-4